منابع مشابه
Curves Defined by Chebyshev Polynomials
Working over a field k of characteristic zero, this paper studies line embeddings of the form φ = (Ti, Tj , Tk) : A → A, where Tn denotes the degree n Chebyshev polynomial of the first kind. In Section 4, it is shown that (1) φ is an embedding if and only if the pairwise greatest common divisor of i, j, k is 1, and (2) for a fixed pair i, j of relatively prime positive integers, the embeddings ...
متن کاملCharacteristic polynomials of automorphisms of hyperelliptic curves
Let α be an automorphism of a hyperelliptic curve C of genus g and let α be the automorphism induced by α on the genus-0 quotient of C by the hyperelliptic involution. Let n be the order of α and let n be the order of α. We show that the characteristic polynomial f of the automorphism α∗ of the Jacobian of C is determined by the values of n, n, and g, unless n = n, n is even, and (2g + 2)/n is ...
متن کاملOn zero curves of bivariate polynomials
With the emergence of algebraic curves and surfaces in geometric modelling [2,4,6,11,12, 21,22] it is important to be able to predict how many connected components the zero set of a multivariate function has in terms of its coefficients. It would be especially useful to find a condition which ensures that the zero set is a single curve or surface. For univariate polynomials Descartes’ Rule of S...
متن کاملHomogeneous Cyclotomic Polynomials and Rationality of Curves
Let k be a field of arbitrary characteristic. Suppose that f1, . . . , fn are polynomials in k[t] and di = deg(fi). We prove that, if gcd of d1, . . . , dn is 1, then k(f1, . . . , fn) = f(t), or equivalently, the morphism ψ = (f1, . . . , fn) : Ak → A n k is proper and birational onto its image. By combining this result with the epimorphism theorem of Abhyankar and Moh, we prove that, if f and...
متن کاملComputing Node Polynomials for Plane Curves
According to the Göttsche conjecture (now a theorem), the degree N of the Severi variety of plane curves of degree d with δ nodes is given by a polynomial in d, provided d is large enough. These “node polynomials” Nδ(d) were determined by Vainsencher and Kleiman–Piene for δ ≤ 6 and δ ≤ 8, respectively. Building on ideas of Fomin and Mikhalkin, we develop an explicit algorithm for computing all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quaestiones Mathematicae
سال: 2015
ISSN: 1607-3606,1727-933X
DOI: 10.2989/16073606.2014.981727